An EM Algorithm for Continuous-time Bivariate Markov Chains

نویسندگان

  • Brian L. Mark
  • Yariv Ephraim
چکیده

We study properties and parameter estimation of finite-state homogeneous continuous-time bivariate Markov chains. Only one of the two processes of the bivariate Markov chain is observable. The general form of the bivariate Markov chain studied here makes no assumptions on the structure of the generator of the chain, and hence, neither the underlying process nor the observable process is necessarily Markov. The bivariate Markov chain allows for simultaneous jumps of the underlying and observable processes. Furthermore, the inter-arrival time of observed events is phase-type. The bivariate Markov chain generalizes the batch Markovian arrival process as well as the Markov modulated Markov process. We develop an expectationmaximization (EM) procedure for estimating the generator of a bivariate Markov chain, and we demonstrate its performance. The procedure does not rely on any numerical integration or sampling scheme of the continuous-time bivariate Markov chain. The proposed EM algorithm is equally applicable to multivariate Markov chains.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Dynamic Programming with Markov Chains for Optimal Sustainable Control of the Forest Sector with Continuous Cover Forestry

We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...

متن کامل

Time discretization of continuous-time filters and smoothers for HMM parameter estimation

In this paper we propose algorithms for parameter estimation of fast-sampled homogeneous Markov chains observed in white Gaussian noise. Our algorithms are obtained by the robust discretization of stochastic differential equations involved in the estimation of continuous-time Hidden Markov Models (HMM’s) via the EM algorithm. We present two algorithms: The first is based on the robust discretiz...

متن کامل

Bivariate Markov Processes and Their Estimation

A bivariate Markov process comprises a pair of random processes which are jointly Markov. One of the two processes in that pair is observable while the other plays the role of an underlying process. We are interested in three classes of bivariate Markov processes. In the first and major class of interest, the underlying and observable processes are continuous-time with finite alphabet; in the s...

متن کامل

Forward-reverse EM algorithm for Markov chains

We develop an EM algorithm for estimating parameters that determine the dynamics of a discrete time Markov chain evolving through a certain measurable state space. As a key tool for the construction of the EM method we develop forward-reverse representations for Markov chains conditioned on a certain terminal state. These representations may be considered as an extension of the earlier work [1]...

متن کامل

Estimation in the Mixture of Markov Chains Moving with Different Speeds

This paper considers a new mixture of time homogeneous finite Markov chains where the mixing is on the rate of movement and develops the EM algorithm for the maximum likelihood estimation of the parameters of the mixture. A continuous and discrete time versions of the mixture are defined and their estimation is considered separately. The simulation study is carried out for the continuous time m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computational Statistics & Data Analysis

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2013